Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction
نویسندگان
چکیده
منابع مشابه
SL2 Expressive Completeness of Separation Logic With Two Variables and No Separating Conjunction
Separation logic is used as an assertion language for Hoare-style proof systems about programs with pointers, and there is an ongoing quest for understanding its complexity and expressive power. Herein, we show that first-order separation logic with one record field restricted to two variables and the separating implication (no separating conjunction) is as expressive as weak second-order logic...
متن کاملOn the Expressive Completeness of Bernays-Schönfinkel-Ramsey Separation Logic
This paper investigates the satisfiability problem for Separation Logic, with unrestricted nesting of separating conjunctions and implications, for prenex formulae with quantifier prefix in the language ∃∗∀∗, in the cases where the universe of possible locations is either countably infinite or finite. In analogy with first-order logic with uninterpreted predicates and equality, we call this fra...
متن کاملSemipositivity in Separation Logic with Two Variables
In a recent work by Demri and Deters (CSL-LICS 2014), first-order separation logic restricted to two variables and separating implication was shown undecidable, where it was shown that even with only two variables, if the use of negations is unrestricted, then they can be nested with separating implication in a complex way to get the undecidability result. In this paper, we revisit the decidabi...
متن کاملExpressive Completeness of Temporal Logic of Action
The paper compares the expressive power of monadic second order logic of order, a fundamental formalism in mathematical logic and theory of computation, with that of a fragment of Temporal Logic of Actions introduced by Lamport for specifying the behavior of concurrent systems.
متن کاملExpressive completeness of temporal logic of trees
Many temporal and modal logic languages can be regarded as subsets of rst order logic i e the semantics of a temporal logic formula is given as a rst order condition on points of the underlying models Kripke structures Often the set of possible models is restricted to models which are trees A temporal logic language is rst order expressively complete if for every rst order condition for a node ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2016
ISSN: 1529-3785,1557-945X
DOI: 10.1145/2835490